Professor Sanders' "Deuteronomy-Joshua"

High Performance Transactions in Deuteronomy

The Deuteronomy architecture provides a clean separation of transaction functionality (performed in a transaction component, or TC) from data management functionality (performed in a data component, or DC). In prior work we implemented both a TC and DC that achieved modest performance. We recently built a high performance DC (the Bw-tree key value store) that achieves very high performance on m...

Deuteronomy: Transaction Support for Cloud Data

The Deuteronomy system supports efficient and scalable ACID transactions in the cloud by decomposing functions of a database storage engine kernel into: (a) a transactional component (TC) that manages transactions and their “logical” concurrency control and undo/redo recovery, but knows nothing about physical data location and (b) a data component (DC) that maintains a data cache and uses acces...

The All Souls Deuteronomy and the Decalogue

Multi-Version Range Concurrency Control in Deuteronomy

The Deuteronomy transactional key value store executes millions of serializable transactions/second by exploiting multi-version timestamp order concurrency control. However, it has not supported range operations, only individual record operations (e.g., create, read, update, delete). In this paper, we enhance our multiversion timestamp order technique to handle range concurrency and prevent pha...

Jim Bryan and Marc Sanders

We study the large n limit of the moduli spaces of Gn-instantons on S and CP 2 where Gn is SU(n), Sp(n/2), or SO(n). We show that in the direct limit topology, the moduli space is homotopic to a classifying space. For example, the moduli space of Sp(∞) or SO(∞) instantons on CP 2 has the homotopy type of BU(k) where k is the charge of the instantons. We use our results along with Taubes’ result...